Ela Exponents and Diameters of Strong Products of Digraphs
نویسندگان
چکیده
The exponent of the strong product of a digraph of order m and a digraph of order n is shown to be bounded above by m+n− 2, with equality for Zm ⊠Zn. The exponent and diameter of the strong product of a graph and a digraph are also investigated.
منابع مشابه
Exponents and diameters of strong products of digraphs
The exponent of the strong product of a digraph of order m and a digraph of order n is shown to be bounded above by m+n− 2, with equality for Zm ⊠Zn. The exponent and diameter of the strong product of a graph and a digraph are also investigated.
متن کاملStrongly Connected Multivariate Digraphs
Generalizing the idea of viewing a digraph as a model of a linear map, we suggest a multi-variable analogue of a digraph, called a hydra, as a model of a multi-linear map. Walks in digraphs correspond to usual matrix multiplication while walks in hydras correspond to the tensor multiplication introduced by Robert Grone in 1987. By viewing matrix multiplication as a special case of this tensor m...
متن کاملExponents of Cartesian Products of Two Digraphs of Special Orders
In this paper, we find the maximum exponent of D × E, the cartesian product of two digraphs D and E on n, n + 2 vertices, respectively for an even integer n ≥ 4. We also characterize the extremal cases.
متن کاملUpper Generalized Exponents of Ministrong Digraphs
We obtain upper bounds for the upper generalized exponents of digraphs in the class of ministrong digraphs and in the class of non-primitive ministrong digraphs, characterize the corresponding extremal digraphs, and discuss the numbers attainable as upper generalized exponents of ministrong digraphs.
متن کاملBound for 2-exponents of Primitive Extremal Ministrong Digraphs
We consider 2-colored digraphs of the primitive ministrong digraphs having given exponents. In this paper we give bounds for 2-exponents of primitive extremal ministrong digraphs.
متن کامل